Stability Properties of Neighbourly Random Polytopes
نویسندگان
چکیده
We introduce a quantitative parameter measuring m-neighbourliness of symmetric convex polytopes in R . We discuss this parameter for random polytopes generated by subgaussian vectors and show its stability properties.
منابع مشابه
Edge Expansion of Cubical Complexes
In this paper we show that graphs of “neighbourly” cubical complexes – cubical complexes in which every pair of vertices spans a (unique) cube – have good expansion properties, using a technique based on multicommodity flows. By showing that graphs of stable set polytopes are graphs of neighbourly cubical complexes we give a new proof that graphs of stable set polytopes have edge expansion 1.
متن کاملSparse recovery under weak moment assumptions
We prove that iid random vectors that satisfy a rather weak moment assumption can be used as measurement vectors in Compressed Sensing, and the number of measurements required for exact reconstruction is the same as the best possible estimate – exhibited by a random Gaussian matrix. We then show that this moment condition is necessary, up to a log log factor. In addition, we explore the Compati...
متن کاملTHE NUMBER OF SIMPLICIAL NEIGHBOURLY d-POLYTOPES WITH d+3 VERTICES
In this paper is proved a formula for the number of simplicial neighbourly d-polytopes with d + 3 vertices, when d is odd. §
متن کاملSubpolytopes of Cyclic Polytopes
A remarkable result of I. Shemer [4] states that the combinatorial structure of a neighbourly 2m-polytope determines the combinatorial structure of each of its subpolytopes. From this, it follows that every subpolytope of a cyclic 2m-polytope is cyclic. In this note, we present a direct proof of this consequence that also yields that certain subpolytopes of a cyclic (2m+ 1)-polytope are cyclic.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete & Computational Geometry
دوره 41 شماره
صفحات -
تاریخ انتشار 2009